package cn.pugle.oj.leetcode;

import cn.pugle.oj.catalog.Backtracking;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

/**
 * 1 <= candidates[i] <= 200
 * All elements of candidates are distinct.
 * <p>
 * 这个回溯写的太不正经了, todo 写个正经的
 * https://leetcode.com/problems/combination-sum/discuss/16502/A-general-approach-to-backtracking-questions-in-Java-(Subsets-Permutations-Combination-Sum-Palindrome-Partitioning)
 *
 * @author tzp
 * @since 2020/10/16
 */
public class LC39_1 implements Backtracking {
    List<List<Integer>> result = new ArrayList<>();

    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        return result;
    }

    public static void main(String[] args) {
        System.out.println(new LC39_1().combinationSum(new int[]{2, 3, 5}, 8));
        System.out.println(new LC39_1().combinationSum(new int[]{2, 3, 5}, 9));
    }

}
